Model Conjectures for Z Specifications
نویسندگان
چکیده
The primary purpose of a specification is to make explicit the intentions of designers. For these intentions to be expressed precisely, a formal (mathematical) language should be used. The use of a formal language per se does not guarantee that intentions will be expressed correctly, but provides a basis for arguments of correctness. Z is a rich and expressive formal language. Arguments of correctness translate, in Z, to arguments about models of specifications, i.e., the values assigned to components of the specification that simultaneously satisfy the constraints of the specification. A specification for which there is no model cannot be a correct expression of any reasonable intentions. A model conjecture for a specification is a conjecture the proof of which is a proof that the specification has a model. This paper shows how a model conjecture may be formally derived from a Z specification.
منابع مشابه
The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof
The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only tested conjectures by random testing. The new Quickcheck extends the previous one and integrates two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conject...
متن کاملThe New Quickcheck for Isabelle Random, Exhaustive and Symbolic Testing Living Under One Roof
The new Quickcheck is a counterexample generator for Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing strategies. The previous Quickcheck only tested conjectures by random testing. The new Quickcheck extends the previous one and integrates two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conject...
متن کاملCounterexample generation for higher-order logic using functional and logic programming
This thesis presents a counterexample generator for the interactive theorem prover Isabelle/HOL that uncovers faulty specifications and invalid conjectures using various testing methods. The primary contributions are two novel testing strategies: exhaustive testing with concrete values; and symbolic testing, evaluating conjectures with a narrowing strategy. Orthogonally to the strategies, this ...
متن کاملFinding Minimal Unsatisfiable Cores of Declarative Specifications
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checking and theorem proving alone. Recycling core extraction is a new coverage analysis that pinpoints an irreducible unsatisfiable core of a declarative specification. It is based on resolution refutation proofs generated...
متن کامل